Based on the analysis of the prefix length distribution and prefix level relationships of the routing table, a new IPv6 route search algorithm based on perfect-Hash table and multibit-trie was proposed to improve the efficiency of the IPv6 address search. The prefixes of the addresses divided into intervals were stored in three Hash tables according to the length of 32, 40 and 48, and the rest bits were stored in multibit-tries. IPv6 routing adopted a two-stage search. The first stage was in the perfect-Hash table and the second in the multibit-trie. The experimental results demonstrate that the average search path of the algorithm is 1.0 - 1.7, and it can be applied to the high performance IPv6 route search.